An Accurate Identification of Extended XML Tree Pattern for XQuery Language

نویسندگان

  • Husheng Liao
  • Xiaoqing Li
  • Junpeng Chen
چکیده

In order to utilize high-performance XML tree pattern query (TPQ) for implementing of XQuery language effectively, it is necessary to analysis the query plan and identify tree pattern from it. In this paper, we extend the functional intermediate language FXQL, which is used to implement XQuery language, with an extended XML generalized tree pattern representation (GTP++). Then, we propose an XML tree pattern identification approach, which is composed of a suit of query expression rewriting rules for extracting tree pattern and a GTP++ construction algorithm. Based on this approach, both explicit and implied propositional logic, various structural constraints and predicates can be extracted across nested query blocks in XQuery FLWOR expressions. The tree pattern identified by this approach is more holistic and precisely than previous methods. The approach expands the application of XML tree pattern query technology in the implementation of XQuery language. Experiments show its effectiveness and practicability.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Formal Description of XML Tree Pattern Query for XQuery Language

In order to express tree pattern query in query plan and take advantage of formal method to analyze its behavioral characteristics, this paper present a formal description of tree pattern query based on functional language and denotational semantics. This description major focuses on behavior of a tree pattern query on matching against an eXtensible Markup Language (XML) document tree. First, w...

متن کامل

Algebra-based identification of tree patterns in XQuery

Query processing performance in XML databases can be greatly enhanced by the usage of materialized views whose content has been stored in the database. This requires a method for identifying query subexpressions matching the views, a process known as view-based query rewriting. This process is quite complex for relational databases, and all the more daunting on XML databases. Current XML materi...

متن کامل

An extensible rule transformation model for XQuery optimization - rules pattern for XQuery tree graph view

Efficient evaluation of XML Query Languages has become a crucial issue for XML exchanges and integration. Tree Pattern (Sihem et al., 2002; Jagadish et al., 2001; Chen et al., 2003) are now well admitted for representing XML Queries and a model -called TGV (Travers, 2006; Travers et al., 2006; Travers et al., 2007c)has extended the Tree Pattern representation in order to make it more intuitive,...

متن کامل

From Tree Patterns to Generalized Tree Patterns: On Efficient Evaluation of XQuery

XQuery is the de facto standard XML query language, and it is important to have efficient query evaluation techniques available for it. A core operation in the evaluation of XQuery is the finding of matches for specified tree patterns, and there has been much work towards algorithms for finding such matches efficiently. Multiple XPath expressions can be evaluated by computing one or more tree p...

متن کامل

Tree Graph Views: On Efficient Evaluation of XQuery in an XML Mediator

XQuery is the emerging standard for querying XML data sources. XLive is a light XML/XQuery mediator developed at University of Versailles whose engine processes an XML algebra derived from the relational one extended to process in dataflow XML trees. The query optimizer translates a subset of XQuery in this algebra. To extend the optimizer’s coverage of XQuery and better optimize query plans, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014